翻訳と辞書 |
Map folding In combinatorial mathematics the map folding problem is the question of how many ways there are to fold a rectangular map along its creases, disregarding any directionality in the creases. A related problem called the stamp folding problem is how many ways there are to fold a strip of stamps. For example, there are six ways to fold a strip of three different stamps: And there are eight ways to fold a 2×2 map along its creases: The problem is related to a problem in the mathematics of origami of whether a square with a crease pattern can be folded to a flat figure. Some simple extensions to the problem of folding a map are NP-complete.〔.〕 ==References==
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Map folding」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|